Shearer’s Entropy Lemma and the Tsp
نویسنده
چکیده
This note aims to give an application of entropy to the analysis of algorithms, using Shearer’s entropy lemma to bound the running time of Bellman’s dynamic programming solution to the traveling salesman problem. The original venue for this material was my course Randommised algorithms (2008) at Lund University. 1. The Traveling Salesman Problem Given a weighted graph like
منابع مشابه
Lecture 6 . The Cluster Expansion Lemma
We have seen the Lovász Local Lemma and its stronger variant, Shearer’s Lemma, which is unfortunately quite unwieldy in applications. Quite recently, researchers in mathematical physics discovered an intermediate form of the lemma, which seems to give results close to Shearer’s Lemma but it is much more easily applicable. First let us review a connection between Shearer’s Lemma and statistical ...
متن کاملLecture 7 . The Cluster Expansion Lemma
We have seen the Lovász Local Lemma and its stronger variant, Shearer’s Lemma, which is unfortunately quite unwieldy in applications. Quite recently, researchers in mathematical physics discovered an intermediate form of the lemma, which seems to give results close to Shearer’s Lemma but it is much more easily applicable. First let us review a connection between Shearer’s Lemma and statistical ...
متن کاملHypercontractivity Via the Entropy Method
The Hypercontractive Inequality of Bonami (1968, 1970) and Gross (1975) is equivalent to the following statement: for every q > 2 and every function f : {−1,1}n→ R of Fourier degree at most m, ‖ f‖q ≤ (q−1)m/2‖ f‖2 . The original proof of this inequality is analytical. Friedgut and Rödl (2001) gave an alternative proof of the slightly weaker Hypercontractive Inequality ‖ f‖4 ≤ 28m/4‖ f‖2 by com...
متن کاملInequalities for Sums of Joint Entropy Based on the Strong Subadditivity
In what follows, V = {1, . . . , n} is the set of indices of given random variables X1, . . . , Xn, and B = {B1, . . . , Bm} is a set of subsets (possibly with repeat) of V . Furthermore, for S = {i1, . . . , il} ⊆ V , XS and H(XS) denote the random vector (Xi1 , . . . , Xil) and its Shannon entropy H(Xi1 , . . . , Xil) (H(X∅) = 0). The power set (the set of all subsets) and the set of all l-su...
متن کاملOn the Number of Regular Edge Labelings
We prove that any irreducible triangulation on n vertices has O(4.6807) regular edge labelings and that there are irreducible triangulations on n vertices with Ω(3.0426) regular edge labelings. Our upper bound relies on a novel application of Shearer’s entropy lemma. As an example of the wider applicability of this technique, we also improve the upper bound on the number of 2-orientations of a ...
متن کامل